- combination automata
- 组合自动机
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
combination automata
Look at other dictionaries:
Automata-based programming — is a programming paradigm in which the program or its part is thought of as a model of a finite state machine or any other (often more complicated) formal automata (see automata theory). Sometimes a potentially infinite set of possible states is… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Inventions in medieval Islam — A significant number of inventions were developed in the medieval Islamic world, a geopolitical region that has at various times extended from Al Andalus and Africa in the west to the Indian subcontinent and Malay Archipelago in the east.… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Von Neumann universal constructor — John von Neumann s Universal Constructor is a self replicating machine in a cellular automata environment. It was designed in the 1940s, without the use of a computer. The fundamental details of the machine were published in von Neumann s book… … Wikipedia
Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… … Wikipedia
Mathematical and theoretical biology — is an interdisciplinary scientific research field with a range of applications in biology, medicine and biotechnology.[1] The field may be referred to as mathematical biology or biomathematics to stress the mathematical side, or as theoretical… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Al-Jazari — Abū al Iz Ibn Ismā īl ibn al Razāz al Jazarī (1136 1206) ( ar. أَبُو اَلْعِزِ بْنُ إسْماعِيلِ بْنُ الرِّزاز الجزري) was an important Arab [citation|title=Archimedes Weapons of War and Leonardo|first=D. L.|last=Simms|journal=The British Journal… … Wikipedia
